A two-dimensional inequality and uniformly continuous retractions
نویسندگان
چکیده
منابع مشابه
Normic Inequality of Two-dimensional Viscosity Operator
A relation between the coefficients of Legendre expansions of two-dimensional function and those for the derived function is given. With this relation the normic inequality of two-dimensional viscosity operator is obtained.
متن کاملRings of Uniformly Continuous Functions
There is a natural bijective correspondence between the compactifications of a Tychonoff space X, the totally bounded uniformities on X, and the unital C∗-subalgebras of C∗(X) (the algebra of bounded continuous complex valued functions on X) with what we call the completely regular separation property. The correspondence of compactifications with totally bounded uniformities is well know and ca...
متن کاملOn Continuous Choice of Retractions onto Nonconvex Subsets
For a Banach space B and for a class A of its bounded closed retracts, endowed with the Hausdorff metric, we prove that retractions on elements A ∈ A can be chosen to depend continuously on A, whenever nonconvexity of each A ∈ A is less than 1 2 . The key geometric argument is that the set of all uniform retractions onto an α−paraconvex set (in the spirit of E. Michael) is α 1−α −paraconvex sub...
متن کاملBetween continuous and uniformly continuous functions on R n ∗
We study classes of continuous functions on R that can be approximated in various degree by uniformly continuous ones (uniformly approachable functions). It was proved in [BDP1] that no polynomial function can distinguish between them. We construct examples that distinguish these classes (answering a question from [BDP1]) and we offer appropriate forms of uniform approachability that enable us ...
متن کاملA CHARACTERIZATION FOR METRIC TWO-DIMENSIONAL GRAPHS AND THEIR ENUMERATION
The textit{metric dimension} of a connected graph $G$ is the minimum number of vertices in a subset $B$ of $G$ such that all other vertices are uniquely determined by their distances to the vertices in $B$. In this case, $B$ is called a textit{metric basis} for $G$. The textit{basic distance} of a metric two dimensional graph $G$ is the distance between the elements of $B$. Givi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 2008
ISSN: 0022-247X
DOI: 10.1016/j.jmaa.2007.07.032